Online scheduling on three uniform machines
نویسندگان
چکیده
منابع مشابه
Two semi-online scheduling problems on two uniform machines
This paper considers two semi-online scheduling problems, one with known optimal value and the other with known total sum, on two uniform machines with a machine speed ratio of s ≥ 1. For the first problem, we provide an optimal algorithm for s ∈ [ 1+ √
متن کاملOn the optimality of list scheduling for online uniform machines scheduling
This paper considers classical online scheduling problems on uniform machines. We show the tight competitive ratio of LS for any combinations of speeds of three machines. We prove that LS is optimal when s3 ≥ s2 ≥ s1 = 1 and s3 ≥ s2 + s2s3 + s2, where s1, s2, s3 are the speeds of three machines. On the other hand, LS can not be optimal for all combinations of machine speeds, even restricted to ...
متن کاملScheduling on Uniform Nonsimultaneous Parallel Machines
We consider the problem of scheduling on uniform processors which may not start processing at the same time with the purpose of minimizing the maximum completion time. We give a variant of the Multifit algorithm which generates schedules which end within 1.382 times the optimal maximum completion time for the general problem, and within √ 6/2 times the optimal maximum completion time for proble...
متن کاملSemi-online scheduling on two uniform processors
In this paper we consider the problem of semi on-line scheduling on two uniform processors, in the case where the total sum of the tasks is known in advance. Tasks arrive one at a time and have to be assigned to one of the two processors before the next one arrives. The assignment cannot be changed later. The objective is the minimization of the makespan. We derive lower bounds and algorithms, ...
متن کاملOnline Preemptive Scheduling on Parallel Machines
We consider an online version of the classical problem of preemptive scheduling on uniformly related machines. We are given m machines with speeds s 1 ≥ s 2 ≥. .. ≥ s m and a sequence of jobs, each described by its processing time (length). The actual time needed to process a job with length p on a machine with speed s is p/s. In the preemptive version, each job may be divided into several piec...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2012
ISSN: 0166-218X
DOI: 10.1016/j.dam.2011.10.001